The approximate Determinantal Assignment Problem
نویسندگان
چکیده
منابع مشابه
The Approximate Determinantal Assignment Problem
The Determinantal Assignment Problem (DAP) has been introduced as the unifying description of all frequency assignment problems in linear systems and it is studied in a projective space setting. This is a multi-linear nature problem and its solution is equivalent to finding real intersections between a linear space, associated with the polynomials to be assigned, and the Grassmann variety of th...
متن کاملApproximate Solutions of the Determinantal Assignment Problem and Distance Problems
The paper introduces the formulation of an exact algebrogeometric problem, the study of the Determinantal Assignment Problem (DAP) in the set up of design, where approximate solutions of the algebraic problem are sought. Integral part of the solution of the Approximate DAP is the computation of distance of a multivector from the Grassmann variety of a projective space. We examine the special ca...
متن کاملParameterisation of Degenerate Solutions of the Determinantal Assignment Problem
The paper is concerned with defining and parametrising the families of all degenerate compensators (feedback, squaring down etc) in a variety of linear control problems. Such compensators indicate the boundaries of the control design, but they also provide the means for linearising the nonlinear nature of the Determinantal Assignment Problems, which provide the unifying description for all freq...
متن کاملApproximate Inference in Continuous Determinantal Point Processes
Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of the defining kernel matrix. Recently, there has been growing interest in usi...
متن کاملApproximate Inference in Continuous Determinantal Processes
Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of the defining kernel matrix. Recently, there has been growing interest in usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.07.008